# -*- coding: utf-8 -*-
'''
@author: Ricardo Faria 6315 e Luís Freitas 5602
@date: 8 abril de 2013
'''
from bubble import Bubblesort
from heapsort import Heapsort
from insertion import Insertion
from merge import Merge
from quick import Quick

A = [2, 1, 3, 5, 4, 20, 10, 14, 19, 29]

#bubble
bubble = Bubblesort(A)
bubble.bubblesort()
print 'Lista:'
print A
print '\n Lista ordenada pelo Bubble Sort:'
print A
print ' '

A = [2, 1, 3, 5, 8]
#heapsort
heap = Heapsort(A)
heap.heapsort()
print '\n\n\nLista:'
print A
print '\nLista ordenada pelo Heap Sort:'
print A
print ' '

A = [2, 1, 3, 5, 4,7,9, 12, 20, 29]
#insertion sort
insertion = Insertion(A)
insertion.insertion_sort()
print '\n\n\nLista:'
print A
print '\nLista ordenada pelo Insertion Sort:'
print A
print ' '


A = [2, 1, 3, 5, 4,7,9, 12, 20, 29, 25]
#merge sort
merge = Merge(A)
merge.merge_sort(0, len(A)-1)
print '\n\n\nLista:'
print A
print '\nLista ordenada pelo Merge Sort:'
print A
print ' '


A = [2, 1, 3, 5, 4,7,9, 12, 20, 21]
#quick sort
quick = Quick(A)
quick.quicksort(0, len(A)-1)
print '\n\n\nLista:'
print A
print '\nLista ordenada pelo Quick Sort:'
print A
